Topology Control for Efficient Information Dissemination in Ad-hoc Networks

In this paper, we explore the information dissemination problem in ad-hoc wireless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bound relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of successful broadcast within a bounded number of transmissions is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination. keywords: topology control, connectivity, transmission power, information dissemination, wireless networks.